Generic model for resource allocation in transportation: Application to urban parking management

In this paper, we define the online localized resource allocation problem, especially relevant for modeling transportation applications. The problem modeling takes into account simultaneously the geographical location of consumers and resources together with their online nondeterministic appearance. We use urban parking management as an illustration of this problem. In fact, urban parking management is an online localized resource allocation problem, where the question is how to find an efficient allocation of parking spots to drivers, while they all have dynamic geographical positions and appear nondeterministically. We define this problem and propose a multiagent system to solve it. The objective of the system is to decrease, for private vehicles drivers, the parking spots search time. The drivers are organized in communities and share information about spots availability. We have defined two cooperative models and compared them: a fully cooperative model, where agents share all the available information, and a “coopetitive” model, where drivers do not share information about the spot that they have chosen. Results show the superiority of the first model.